On lexicographical ordering in multivariate mathematical morphology
نویسندگان
چکیده
منابع مشابه
On lexicographical ordering in multivariate mathematical morphology
Since mathematical morphology is based on complete lattice theory, a vector ordering method becomes indispensable for its extension to multivariate images. Among the several approaches developed with this purpose, lexicographical orderings are by far the most frequent, as they possess certain desirable theoretical properties. However, their main drawback consists of the excessive priority attri...
متن کاملA comparative study on multivariate mathematical morphology
The successful application of univariate morphological operators on several domains, along with the increasing need for processing the plethora of available multivalued images, have been the main motives behind the efforts concentrated on extending the mathematical morphology framework to multivariate data. The few theoretical requirements of this extension, consisting primarily of a ranking sc...
متن کاملRanking Fuzzy Numbers Based on Lexicographical Ordering
Although so far, many methods for ranking fuzzy numbers have been discussed broadly, most of them contained some shortcomings, such as requirement of complicated calculations, inconsistency with human intuition and indiscrimination. The motivation of this study is to develop a model for ranking fuzzy numbers based on the lexicographical ordering which provides decision-makers with a simple and ...
متن کاملComplete lattice learning for multivariate mathematical morphology
The generalization of mathematical morphology to multivariate vector spaces is addressed in this paper. The proposed approach is fully unsupervised and consists in learning a complete lattice from an image as a nonlinear bijective mapping, interpreted in the form of a learned rank transformation together with an ordering of vectors. This unsupervised ordering of vectors relies on three steps: d...
متن کاملOptimal Cost Parallel Algorithms for Lexicographical Ordering
for sorting n integers from the range !!.) algorithm p Optimal cost parallel algorithms for lexicographical ordering on a CREW PRAM are log n presented here. An 0 (I ( ) og nIp {I•...• n} usingp :::;; n processors is given here. Also an algorithm for sorting n strings of size lover an alphabet of size s is presented. that requires 0 ( log n[ ) .!!!.. + !.... ) units of time log (nllp p p and it...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition Letters
سال: 2008
ISSN: 0167-8655
DOI: 10.1016/j.patrec.2007.09.011